Hitting sets when the VC-dimension is small

نویسندگان

  • Guy Even
  • Dror Rawitz
  • Shimon Shahar
چکیده

We present an approximation algorithm for the hitting set problem when the VC-dimension of the set system is small. Our algorithm builds on Pach & Agarwal [7], and we show how it can be parallelized and extended to the minimum cost hitting set problem. The running time of the proposed algorithm is comparable with that of Brönnimann & Goodrich [2], and the approximation ratio is smaller by a constant factor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hitting Set for Hypergraphs of Low VC-dimension

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis dimension (VC-dimension) of the input is small. VC-dimension is a natural measure of complexity of set systems. Several tractable instances of Hitting Set with a ge...

متن کامل

Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension

We consider the problem of finding a small hitting set in an infinite range space F = (Q,R) of bounded VC-dimension. We show that, under reasonably general assumptions, the infinite dimensional convex relaxation can be solved (approximately) efficiently by multiplicative weight updates. As a consequence, we get an algorithm that finds, for any δ > 0, a set of size O(sF (z ∗ F )) that hits (1− δ...

متن کامل

On the Complexity of Approximating the VC Dimension

We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp3-hard to approximate to within a factor 2− for any > 0, • approximable in AM to within a factor 2, and • AM-hard to approximate to within a factor N for some constant > 0. To obtain the Σp3-hardness result we solve a random...

متن کامل

On the VC-dimension of neural networks with binary weights

We investigate the VC-dimension of the perceptron and simple two-layer networks like the committeeand the parity-machine with weights restricted to values ±1. For binary inputs, the VC-dimension is determined by atypical pattern sets, i.e. it cannot be found by replica analysis or numerical Monte Carlo sampling. For small systems, exhaustive enumerations yield exact results. For systems that ar...

متن کامل

Propagation Models and Fitting Them for the Boolean Random Sets

In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 95  شماره 

صفحات  -

تاریخ انتشار 2005